Traditionally, algorithms that generate schedules are either based on domain analyses or on task analyses. Both approaches have disadvantages. Algorithms based on domain analyses are often not used by human planners and schedulers. Algorithms based on task analyses, however, do not use the potential improvements in quality that domain based algorithms can attain. In this paper, the advantages of both approaches are combined by applying a mixed approach. Combinatorial optimization algorithms have been developed and implemented for two subtasks that were identified in a task analysis of shunting planners at The Netherlands Railways. Because of the approach taken the algorithms are usable in practice, which can improve both the quality and the...
Scheduling is the process of devising or designing a procedure for a particular objective, specifyin...
Efficient public transportation is becoming increasingly vital for modern capitals. DSB S-tog a/s is...
Sometimes a complex combinatorial problem has easily identifiable subproblems for which methods are ...
Abstract. Train shunting planning for the Netherlands Railways is a complex planning problem that is...
This chapter discusses the insights developed for designing scheduling algorithms according to three...
The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorit...
In this talk, we will present the results of an experimental study towards building an automatic alg...
The scheduling of locomotive movements on cane railways has proven to be a very complex task. Vario...
Planning and scheduling problem is a hard problem, especially in real life cases. The time and space...
Scheduling is the process of devising or designing a procedure for a particular objective, specifyin...
Solving scheduling problems has long presented a challenge for computer scientists and operations ...
This article describes the genetic algorithm used to solve the problem related to the scheduling the...
Railway planning is a continuous and very complex planning process in which many planners are involv...
Time management is an important factor highly considered in any organization or system because it go...
The accomplishment of a manufacturing company's objectives is strongly connected to the efficient so...
Scheduling is the process of devising or designing a procedure for a particular objective, specifyin...
Efficient public transportation is becoming increasingly vital for modern capitals. DSB S-tog a/s is...
Sometimes a complex combinatorial problem has easily identifiable subproblems for which methods are ...
Abstract. Train shunting planning for the Netherlands Railways is a complex planning problem that is...
This chapter discusses the insights developed for designing scheduling algorithms according to three...
The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorit...
In this talk, we will present the results of an experimental study towards building an automatic alg...
The scheduling of locomotive movements on cane railways has proven to be a very complex task. Vario...
Planning and scheduling problem is a hard problem, especially in real life cases. The time and space...
Scheduling is the process of devising or designing a procedure for a particular objective, specifyin...
Solving scheduling problems has long presented a challenge for computer scientists and operations ...
This article describes the genetic algorithm used to solve the problem related to the scheduling the...
Railway planning is a continuous and very complex planning process in which many planners are involv...
Time management is an important factor highly considered in any organization or system because it go...
The accomplishment of a manufacturing company's objectives is strongly connected to the efficient so...
Scheduling is the process of devising or designing a procedure for a particular objective, specifyin...
Efficient public transportation is becoming increasingly vital for modern capitals. DSB S-tog a/s is...
Sometimes a complex combinatorial problem has easily identifiable subproblems for which methods are ...